Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse
نویسندگان
چکیده
منابع مشابه
A Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse
We propose an algorithm for multistage stochastic linear programs with recourse where random quantities in di erent stages are independent. The algorithm successively approximates expected recourse functions by building up valid cutting planes to support these functions from below. In each iteration, for the expected recourse function in each stage, one cutting-plane is generated using the dual...
متن کاملConvergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse
We propose an algorithm for multistage stochastic linear programs with recourse where random quantities in different stages are independent. The algorithm approximates successively expected recourse functions by building up valid cutting planes to support these functions from below. In each iteration, for the expected recourse function in each stage, one cutting plane is generated using the dua...
متن کاملThe Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse
This paper considers large-scale multistage stochastic linear programs. Sampling is incorporated into the nested decomposition algorithm in a manner which proves to be significantly more efficient than a previous approach. The main advantage of the method arises from maintaining a restricted set of solutions that substantially reduces computation time in each stage of the procedure. Dedicated t...
متن کاملCutting Planes for Multistage Stochastic Integer Programs
This paper addresses the problem of finding cutting planes for multi-stage stochastic integer programs.We give a general method for generating cutting planes for multi-stage stochastic integer programs basedon combining inequalities that are valid for the individual scenarios. We apply the method to generatecuts for a stochastic version of a dynamic knapsack problem and to stochasti...
متن کاملAn Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs
In this paper, an interior point algorithm for linear programs is adapted for solving multistage stochastic linear programs. The algorithm is based on Monteiro and Adler’s path-following algorithm for deterministic linear programs. In practice, the complexity of the algorithm is linear with respect to the size of the sample space. The algorithm starts from a feasible solution of the problem and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1999
ISSN: 0022-3239,1573-2878
DOI: 10.1023/a:1022641805263